Canonical Typing and Pi-Conversion in the Barendregt Cube
نویسندگان
چکیده
In this article, we extend the Barendregt Cube with II-conversion (which is the analogue of ,B-conversion, on product type level) and study its properties. We use this extension to separate the problem of whether a term is typable from the problem of what is the type of a term.
منابع مشابه
Canonical typing and - conversion in the Barendregt
In this article, we extend the Barendregt Cube with -conversion (which is the analogue of -conversion, on product type level) and study its properties. We use this extension to separate the problem of whether a term is typable from the problem of what is the type of a term.
متن کاملCanonical typing and - conversion
In usual type theory, if a function f is of type ! 0 and an argument a is of type , then the type of fa is immediately given to be 0 and no mention is made of the fact that what has happened is a form of -conversion. A similar observation holds for the generalized Cartesian product types, x: : . In fact, many versions of type theory assume that holds of both types and terms, yet only a few atte...
متن کاملDeenitions and -conversion in Type Theory
In KN 95b], the Barendregt Cube was extended with-conversion. The resulting system had only a Weak form of Subject Reduction. In this paper, the Cube is extended with explicit deenitions. We show that the Cube extended with either explicit deenitions alone or with both explicit deenitions and-conversion satisses all its original properties including Subject Reduction.
متن کاملThe Barendregt Cube with De nitions and GeneralisedReduction
In this paper, we propose to extend the Barendregt Cube by generalising reduction and by adding de nition mechanisms. We show that this extension satis es all the original properties of the Cube including Church Rosser, Subject Reduction and Strong Normalisation.
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Funct. Program.
دوره 6 شماره
صفحات -
تاریخ انتشار 1996